Maximum a Posteriori Decoding of Turbo Codes

نویسنده

  • Bernard Sklar
چکیده

The process of turbo-code decoding starts with the formation of a posteriori probabilities (APPs) for each data bit, which is followed by choosing the data-bit value that corresponds to the maximum a posteriori (MAP) probability for that data bit. Upon reception of a corrupted code-bit sequence, the process of decisionmaking with APPs allows the MAP algorithm to determine the most likely information bit to have been transmitted at each bit time. The metrics needed for the implementation of a MAP decoder are presented here, along with an example to illustrate how these metrics are used.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Soft-Output Decoding Algorithms in Iterative Decoding of Turbo Codes

In this article, we present two versions of a simplified maximum a posteriori decoding algorithm. The algorithms work in a sliding window form, like the Viterbi algorithm, and can thus be used to decode continuously transmitted sequences obtained by parallel concatenated codes, without requiring code trellis termination. A heuristic explanation is also given of how to embed the maximum a poster...

متن کامل

Maximum A Posteriori Decoding Algorithms For Turbo Codes

The symbol-by-symbol maximum a posteriori (MAP) known also as BCJR algorithm is described. The logarithmic versions of the MAP algorithm, namely, Log-MAP and Max-Log-MAP decoding algorithms along with a new Simplified-Log-MAP algorithm, are presented here. Their bit error rate (BER) performance and computational cornplexity of these algorithms are compared. A new hardware architecture for imple...

متن کامل

About Symmetric Convolutional Codes of Memory Two and Three Used in Space-time Turbo Coding

In this paper are analysed the performances of different symmetric convolutional turbo codes for a transmission system that uses a doubly iterative decoding algorithm, with multiple antenna diversity. The turbo encoder uses an '–QPP (Quadratic–Permutation–Polynomial) interleaver, and two different decoding algorithms, namely, the Max–Log–APP (Maximum– Logarithm–A–Posteriori–Probability) algori...

متن کامل

Performance Comparison of Turbo Decoding Algorithms

Turbo coding is the most commonly used error correcting scheme in wireless systems resulting in maximum coding gain. In this paper, a comparative study of the symbol-bysymbol maximum a posteriori (MAP) algorithm, its logarithmic versions, namely, Log-MAP and Max-Log-MAP decoding algorithms used in SISO Turbo Decoders are analyzed. The performance of Turbo coding algorithms are carried out in te...

متن کامل

SOVA decoding in Symmetric Alpha-Stable Noise

Soft-Output Viterbi Algorithm (SOVA) is one type of recovery memory-less Markov Chain and is used widely to decode convolutional codes. Fundamentally, conventional SOVA is designed on the basis of Maximum A-Posteriori Probability (APP) with the assumption of normal distribution. Therefore, conventional SOVA fails miserably in the presence of symmetric alpha stable noise S S α which is one form ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002